Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains...(展开全部)

Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains...(展开全部)

Greatly expanded, this new edition requires only an elementary background in discrete mathematics and offers a comprehensive introduction to the role of randomization and probabilistic techniques in modern computer science. Newly added chapters and sections cover topics including normal distributions, sample complexity, VC dimension, Rademacher complexity, power laws and relate...(展开全部)

Written by one of the best-known probabilists in the world this text offers a clear and modern presentation of modern probability theory and an exposition of the interplay between the properties of metric spaces and those of probability measures. This text is the first at this level to include discussions of the subadditive ergodic theorems, metrics for convergence in laws and ...(展开全部)

This classic textbook offers a clear exposition of modern probability theory and of the interplay between the properties of metric spaces and probability measures. The first half of the book gives an exposition of real analysis: basic set theory, general topology, measure theory, integration, an introduction to functional analysis in Banach and Hilbert spaces, convex sets and f...(展开全部)

This classic textbook, now reissued, offers a clear exposition of modern probability theory and of the interplay between the properties of metric spaces and probability measures. The new edition has been made even more self-contained than before; it now includes a foundation of the real number system and the Stone-Weierstrass theorem on uniform approximation in algebras of func...(展开全部)

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algori...(展开全部)

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algori...(展开全部)

Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) solution of the formulated problem. One can solve a problem on its own using ad hoc techniques or follow those techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm d...(展开全部)